Successive Failures of Approachability

نویسنده

  • SPENCER UNGER
چکیده

Motivated by showing that in ZFC we cannot construct a special Aronszajn tree on some cardinal greater than א1, we produce a model in which the approachability property fails (hence there are no special Aronszajn trees) at all regular cardinals in the interval [א2,אω2+3] and אω2 is strong limit.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Robust approachability and regret minimization in games with partial monitoring

Approachability has become a standard tool in analyzing learning algorithms in the adversarial online learning setup. We develop a variant of approachability for games where there is ambiguity in the obtained reward that belongs to a set, rather than being a single vector. Using this variant we tackle the problem of approachability in games with partial monitoring and develop simple and efficie...

متن کامل

Approachability in Stackelberg Stochastic Games with Vector Costs

The notion of approachability was introduced by Blackwell [1] in the context of vector-valued repeated games. The famous ‘Blackwell’s approachability theorem’ prescribes a strategy for approachability, i.e., for ‘steering’ the average vector cost of a given agent towards a given target set, irrespective of the strategies of the other agents. In this paper, motivated by the multi-objective optim...

متن کامل

A Learning Scheme for Approachability in MDPs and Stackelberg Stochastic Games

The notion of approachability was introduced by Blackwell [1] in the context of vector-valued repeated games. The famous ‘Blackwell’s approachability theorem’ prescribes a strategy for approachability, i.e., for ‘steering’ the average vector cost of a given agent towards a given target set, irrespective of the strategies of the other agents. In this paper, motivated by the multi-objective optim...

متن کامل

A Learning Scheme for Blackwell’s Approachability in MDPs and Stackelberg Stochastic Games

The notion of approachability was introduced by Blackwell ([8]) in the context of vector-valued repeated games. The famous ‘Blackwell’s approachability theorem’ prescribes a strategy for approachability, i.e., for ‘steering’ the average vector-cost of a given player towards a given target set, irrespective of the strategies of the other players. In this paper, motivated from the multi-objective...

متن کامل

Situational Context and Perceived Threat Modulate Approachability Judgements to Emotional Faces

Facial expressions of emotion play a key role in guiding social judgements, including deciding whether or not to approach another person. However, no research has examined how situational context modulates approachability judgements assigned to emotional faces, or the relationship between perceived threat and approachability judgements. Fifty-two participants provided approachability judgements...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017